Three Fastest Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures
نویسنده
چکیده
It is well known that computing shortest paths over a network is an important task in many network and transportation related analyses. Choosing an adequate algorithm from the numerous algorithms reported in the literature is a critical step in many applications involving real road networks. In a recent study, a set of three shortest path algorithms that run fastest on real road networks has been identified. These three algorithms are: 1) the graph growth algorithm implemented with two queues, 2) the Dijkstra algorithm implemented with approximate buckets, and 3) the Dijkstra algorithm implemented with double buckets. As a sequel to that study, this paper reviews and summarizes these three algorithms, and demonstrates the data structures and procedures related to the algorithms. This paper should be particularly useful to researchers and practitioners in transportation, GIS, operations research and management sciences.
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملShortest Path Algorithms: An Evaluation Using Real Road Networks
The classic problem of finding the shortest path over a network has been the target of many research efforts over the years. These research efforts have resulted in a number of different algorithms and a considerable amount of empirical findings with respect to performance. Unfortunately, prior research does not provide a clear direction for choosing an algorithm when one faces the problem of c...
متن کاملFast point-to-point shortest path queries on dynamic road networks with interval data
Consider a weighted directed graph G = (V,A, c) (where c : A → R+) which represents a road network evaluated by travelling times (so the graph may not be Euclidean). Assuming that c changes every few minutes, that the cardinality of V is very large (several million vertices), and that each shortest path request must be answered in a few milliseconds, current technology does not allow us to find...
متن کاملModelling a Hierarchy of Space Applied to Large Road Networks
Human beings use hierarchies extensively to simplify their conceptual models of reality and to perform reasoning more efficiently. Hierarchical structures are conceptually imposed on space and allow better performance of complex tasks in very large contexts. To understand how spatial hierarchies are formed and used is one of the most important questions in spatial reasoning research. In this pr...
متن کاملFinding shortest paths on real road networks: the case for A
The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation system to solving spatial allocation problems. Since this type of problem is solved so frequently, it is important to craft an approach that is as efficient as possible. Based upon past research, it is generally accepted that several efficie...
متن کامل